Finite-valued Logics for Information Processing
نویسندگان
چکیده
منابع مشابه
Finite-valued Logics for Information Processing
We examine the issue of collecting and processing information from various sources, which involves handling incomplete and inconsistent information. Inspired by the framework first proposed by Belnap, we consider structures consisting of information sources which provide information about the values of formulas of classical propositional logic, and a processor which collects that information an...
متن کاملProof Theory of Finite-valued Logics
Preface Many-valued logic is not much younger than the whole field of symbolic logic. It was introduced in the early twenties of this century by Lukasiewicz [1920] and Post [1921] and has since developed into a very large area of research. Most of the early work done has concentrated on problems of axiomatizability on the one hand, and algebraical/model theoretic investigations on the other. Th...
متن کاملApproximating Propositional Calculi by Finite-Valued Logics
Bernays introduced a method for proving underivability results in propositional calculi C by truth tables. It is investigated how far this method can be carried using (1) one or (2) an infinite sequence of many-valued logics. It is shown that the best candidate matrices for (1) can be computed from the calculus, and how sequences for (2) can be found for certain classes of logics. Furthermore, ...
متن کاملLabeled Calculi and Finite-Valued Logics
A general class of labeled sequent calculi is investigated and necessary and su cient conditions are given for when such a calculus is sound and complete for a nite valued logic if the labels are interpreted as sets of truth values sets as signs Furthermore it is shown that any nite valued logic can be given an axiomatization by such a labeled calculus using arbitrary systems of signs i e of se...
متن کاملFredkin Gates for Finite–valued Reversible and Conservative Logics
The basic principles and results of Conservative Logic introduced by Fredkin and Toffoli in [FT, 82] on the basis of a seminal paper of Landauer [La, 61] are extended to d–valued logics, with a special attention to three–valued logics. Different approaches to d–valued logics are examined in order to determine some possible universal sets of logic primitives. In particular, we consider the typic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Informaticae
سال: 2012
ISSN: 0169-2968
DOI: 10.3233/fi-2011-615